Flat 2-Foldings of Convex Polygons
نویسندگان
چکیده
A folding of a simple polygon into a convex polyhedron is accomplished by glueing portions of the perimeter of the polygon together to form a polyhedron. A polygon Q is a flat n-folding of a polygon P if P can be folded to exactly cover the surface of Q n times, with no part of the surface of P left over. In this paper we focus on a specific type of flat 2-foldings, flat 2-foldings that wrap Q; that is, foldings of P that cover both sides of Q exactly once. We determine, for any n, all the possible flat 2-foldings of a regular n-gon. We finish our paper studying the set of polygons that are flat 2-foldable to regular polygons.
منابع مشابه
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration questions in both directions: Given a polygon, how many foldings are there? Given a polytope, how many unfoldings are there to simple polygons? Throughout w...
متن کاملThe Foldings of a Square to Convex Polyhedra
The structure of the set of all convex polyhedra foldable from a square is detailed. It is proved that five combinatorially distinct nondegenerate polyhedra, and four different flat polyhedra, are realizable. All the polyhedra are continuously deformable into each other, with the space of polyhedra having the topology of four connected rings.
متن کامل3D Origami Design based on Tucking Molecule
This paper presents a new approach for folding a piece of paper into an arbitrary three-dimensional polyhedral surface based on ”tucking molecules.” The approach is to align the polygons of the three-dimensional surface onto a convex region of a plane and fill the blank area between the polygons with ”tucking molecules.” Tucking molecules are aligned between segments and vertices of the polygon...
متن کاملA method for the enumeration of various classes of column-convex polygons
2 Abstract. We present a new method that allows to enumerate various classes of column-convex polygons, according to their perimeter and their area. The rst step of this method leads to a functional equation which deenes implicitly the generating function of the class under consideration. The second step consists in solving this equation. We apply systematically our method to all the usual clas...
متن کاملpolygons. J. Algorithms, 6(2):213–224, 1985.
[2] B. Bhattacharya and R. Benkoczi. On computing the optimal bridge between two convex polygons. [7] H. Edelsbrunner. Computing the extreme distances between two convex polygons. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons.
متن کامل